Cs880: Approximations Algorithms
نویسنده
چکیده
Last time we discussed how LP-duality can be applied to approximation. We introduced the primaldual method for approximating the optimal solution to an LP in a combinatorial way. We applied this technique to give another 2-approximation for the Vertex Cover problem. In this lecture, we present and analyze a primal-dual algorithm that gives a 2-approximation for the Steiner Forest problem. We also briefly talk about a primal-dual algorithm for Facility Location.
منابع مشابه
Cs880: Approximations Algorithms 1.1 Introduction 1.2 Motivation
Approximation algorithms make up a broad topic and are applicable to many areas. In this course a variety of different techniques for crafting approximation algorithms will be covered. Since there is no fixed procedure that will always work when attempting to solve new problems, the aim of this course is to achieve a solid understanding of the most relevant techniques and to get a feel for when...
متن کاملCs880: Approximations Algorithms 29.1 Vertex Cover
In the previous lecture we introduced probabilistically checkable proofs (PCPs) and saw how they could be used to obtain a tight inapproximability result for MAX-3SAT. We also introduced Hastad’s 3-bit PCP, a very useful tool for proving inapproximability results. In this lecture we apply Hastad’s 3-bit PCP to show that approximating Vertex Cover within any constant factor less than 7/6 is NP-h...
متن کاملCs880: Approximations Algorithms 21.1 Graph Coloring: Overview 21.2 Sdp Formulation
Let G = (V,E) be a graph. A k-coloring for G is a function f : V → [k] such that f(u) 6= f(v) for all (u, v) ∈ E. In other words, a k-coloring is an assignment of vertices to k colors such that no edge is monochromatic. We say that a graph G is k-colorable if there exists a k-coloring for G. The chromatic number of G is the least k such that G is k-colorable. Given a k-colorable graph G, findin...
متن کاملCs880: Approximations Algorithms 7.2 Max-cut 7.2.1 the Problem
Local search is a heuristic technique for solving hard optimization problems and is widely used in practice. Suppose that a certain optimization problem can be formulated as finding a solution maximizing an objective function in the solution space. A local search algorithm for this problem would start from an arbitrary or carefully chosen solution, then iteratively move to other solutions by ma...
متن کاملBounded Degree Approximations of Stochastic Networks
We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify optimal and near-optimal approximations in terms of Kullback-Leibler divergence. The user-chosen sparsity trades off the quality of the approximation against vi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007